Modified Widest Disjoint Paths Algorithm for Multipath Routing

Widest Disjoint Paths (WDP) algorithm is a promising multipath routing algorithm aimed at selecting good paths for routing a flow between a source-destination pair, where their bottleneck links are mutually disjoint. Nevertheless, the complexity of WDP algorithm is relatively high due to the fact that the good path selection process considers all available paths. To reduce its complexity, This paper proposes a modified WDP algorithm, which uses only a subset of available paths based on shortest widest paths, thereby limiting the number of candidate paths considered. As a result, the number of iterations in the good path selection process is significantly reduced. Performance analysis shows the modified scheme is more efficient than the original algorithm in a large network. Simulation results demonstrate that, in comparison with the original WDP algorithm, the modified WDP algorithm leads to lower latency and faster packets transferring process as the number of available paths increases.